課程名稱 |
離散數學 Discrete Mathematics |
開課學期 |
103-2 |
授課對象 |
電機工程學系 |
授課教師 |
雷欽隆 |
課號 |
EE2008 |
課程識別碼 |
901E21100 |
班次 |
01 |
學分 |
2 |
全/半年 |
半年 |
必/選修 |
必修 |
上課時間 |
星期三3,4(10:20~12:10) |
上課地點 |
博理112 |
備註 |
本課程以英語授課。本系學生優先修習 總人數上限:80人 |
Ceiba 課程網頁 |
http://ceiba.ntu.edu.tw/1032dm |
課程簡介影片 |
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
課程大綱
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
課程概述 |
1. Mathematical Reasoning
Logic, Proof methods, Inductive Proofs
2. Combinatorial Analysis
Summations, Countability, Probability, Combinatorics, Recurrences, Boolean Algebra
3. Discrete Structures
Sets, Functions, Sequences, Permutations, Relations, Graphs, Trees, Finite-state Machines
4. Algorithms
Orders of Growth, Complexity. Specification, Program verification
5. Application and modeling
Model of Computation
|
課程目標 |
1. To teach mathematical reasoning and problem solving rather than ad-hoc approaches so that students can think logically and mathematically
2. Guide students to learn how to attack problems
3. To help students develop the skills needed for their further studies. |
課程要求 |
Prerequisite:
None
Grading:
1. Homework Assignments 30 %
2. Midterm 30 %
3. Final exam 40 %
|
預期每週課後學習時數 |
|
Office Hours |
另約時間 |
指定閱讀 |
|
參考書目 |
Textbook: Discrete Mathematics and Its Applications 7th Edition
Kenneth H. Rosen
McGraw-Hill, 2011 |
評量方式 (僅供參考) |
|
週次 |
日期 |
單元主題 |
第1週 |
|
Overview, Logic |
第1週 |
|
Overview, Propositional Logic |
第2週 |
|
Proofs; Basic Structures |
第3週 |
|
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices |
第4週 |
|
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices |
第5週 |
|
Algorithms |
第6週 |
|
Algorithms |
第7週 |
|
Study Day |
第8週 |
|
Solving Recurrence Relations |
第9週 |
|
Midterm Exam. |
第10週 |
|
Number Theory |
第11週 |
|
Number Theory |
第12週 |
|
Cryptography |
第13週 |
|
Induction |
第14週 |
|
Induction, Counting |
第15週 |
|
Counting, Relations |
第16週 |
|
Relations, Graphs, Trees |
第17週 |
|
Dragon Boat Festival |
第18週 |
|
Final Exam. |
|